LP Decoding of Regular LDPC Codes in Memoryless Channels
نویسندگان
چکیده
منابع مشابه
Decoding LDPC Convolutional Codes on Markov Channels
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...
متن کاملOn Universal Ldpc Codes over Memoryless Symmetric Channels
A design of robust error-correcting codes that achieve reliable communication over various channels is of great theoretical and practical interest. Such codes are termed universal. This paper considers the universality of lowdensity parity-check (LDPC) code ensembles over families of memoryless binary-input output-symmetric (MBIOS) channels. Universality is considered both under belief-propagat...
متن کاملLP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
Random (dv, dc)-regular LDPC codes (where each variable is involved in dv parity checks and each parity check involves dc variables) are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv and dc) under exponential time decoding. However, polynomial time algorithms are only known to correct a much smaller fraction of errors. One of the most powe...
متن کاملAdaptive Viterbi decoding of convolutional codes over memoryless channels
In this paper, an adaptive decoding algorithm for convolutional codes, which is a modification of the Viterbi algorithm (VA) is presented. For a given code, the proposed algorithm yields nearly the same error performance as the VA while requiring a substantially smaller average number of computations. Unlike most of the other suboptimum algorithms, this algorithm is self-synchronizing. If the t...
متن کاملλ−Min Decoding Algorithm of Regular and Irregular LDPC Codes
In this paper, the decoding of lowdensity parity-check (LDPC) codes is considered. A new algorithm, named λ−Min algorithm, for updating extrinsic information is proposed. The λ−Min algorithm offers different trade-off performance versus complexity between the belief propagation (BP) algorithm (optimal but complex) and the universal most powerful (UMP) BP-based algorithm (simple but leading to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2094830